Clustering of Microarray data via Clique Partitioning
نویسندگان
چکیده
منابع مشابه
Clustering of Microarray data via Clique Partitioning
Microarrays are repositories of gene expression data that hold tremendous potential for new understanding, leading to advances in functional genomics and molecular biology. Cluster analysis (CA) is an early step in the exploration of such data that is useful for purposes of data reduction, exposing hidden patterns, and the generation of hypotheses regarding the relationship between genes and ph...
متن کاملData Clustering via Principal Direction Gap Partitioning
Data clustering has various applications in a wide variety of fields ranging from social and biological sciences, to business, statistics, information retrieval, machine learning and data mining. Clustering refers to the process of grouping data based only on information found in the data which describes its characteristics and relationships. Although humans are generally very good at discoveri...
متن کاملSolving group technology problems via clique partitioning
This paper presents a new clique partitioning (CP) model for the Group Technology (GT) problem. The new model, based on a novel 0/1 quadratic programming formulation, addresses multiple objectives in GT problems by drawing on production relationships to assign differing weights to machine/ part pairs. The use of this model, which is readily solved by a basic tabu search heuristic, is illustrate...
متن کاملClustering Microarray Data
We begin with an example that will be used throughout the chapter.The data come from Sorlie et al. (2001). The goal of that article was to “classify breast carcinomas based on variations in gene expression derived from complementary deoxyribonucleic acid (cDNA) microarrays and to correlate tumor characteristics to clinical outcome.’’ The data consist of log fluorescence values for 456 cDNA clon...
متن کاملApproximate Clustering via Metric Partitioning
We consider the following metric clustering problem. We are given two point sets X (clients) and Y (servers), and a metric on Z = X ∪ Y . We would like to cover the clients by balls centered at the servers. The objective function to minimize is the sum of the α-th power of the radii of the balls. Here α ≥ 1 is a parameter of the problem (but not of a problem instance). For any ε > 0, we describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2005
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-005-1861-1